Variable neighborhood search for the linear ordering problem
نویسندگان
چکیده
منابع مشابه
A Variable Neighborhood Search for Solving the Linear Ordering Problem
A Systematic change of Neighborhood within a possibly randomized local search algorithm yields a simple and effective metaheuristic for combinatorial and global optimization. In this paper we present a Variable Neighborhood Search implementation designed to find high quality solutions for the NP-hard Linear Ordering Problem, which has a significant number of application in practice, such triang...
متن کاملVariable neighborhood search for the linear ordering problem
Given a matrix of weights, the Linear Ordering Problem (LOP) consists of finding a permutation of the columns and rows in order to maximize the sum of the weights in the upper triangle. This NP-complete problem can also be formulated in terms of graphs, as finding an acyclic tournament with a maximal sum of arc weights in a complete weighted graph. In this paper we first review the previous met...
متن کاملNeighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem
One of the key factors in the eeciency of backtracking algorithms is the rule they use to decide on which variable to branch next (namely, the variable ordering heuristics). In this paper, we give a formulation of dynamic variable ordering heuristics that takes into account the properties of the neighborhood of the variable.
متن کامل„ Variable Neighborhood Search for the Static Aircraft Sequencing Problem
Ich erkläre an Eides statt, daß ich die vorliegende Arbeit selbständig und ohne fremde Hilfe verfasst, andere als die angegebenen Quellen nicht benützt und die den benutzten Quellen wörtlich oder inhaltlich entnommenen Stellen als solche kenntlich gemacht habe.
متن کاملVariable Neighborhood Search for the University Lecturer-Student Assignment Problem
The paper presents a study of local search heuristics in general and variable neighborhood search in particular for the resolution of an assignment problem studied in the practical work of universities. Here, students have to be assigned to scientific topics which are proposed and supported by members of staff. The problem involves the optimization under given preferences of students which may ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2006
ISSN: 0305-0548
DOI: 10.1016/j.cor.2005.03.032